On the succinctness of some modal logics
نویسندگان
چکیده
Article history: Received 24 February 2012 Received in revised form 12 February 2013 Accepted 16 February 2013 Available online 18 February 2013
منابع مشابه
The Relative Succinctness and Expressiveness of Modal Logics Can Be Arbitrarily Complex
We study the relative succinctness and expressiveness of modal logics, and prove that these relationships can be as complex as any countable partial order. For this, we use two uniform formalisms to define modal operators, and obtain results on succinctness and expressiveness in these two settings. Our proofs are based on formula size games introduced by Adler and Immerman and bisimulations.
متن کاملOn the Size of Shortest Modal Descriptions
We address the problems of separation and description in some fragments of modal logics. The former consists in finding a formula that is true in some given subset of the domain and false in another. The latter is a special case when one separates a singleton from the rest. We are interested in the shortest size of both separations and descriptions. This is motivated by applications in computat...
متن کاملOn the relative succinctness of modal logics with union, intersection and quantification
In the study of knowledge representation formalisms, there is a current interest in the question of how different formal languages compare in their ability to compactly express semantic properties. Recently, French et al. [9] have shown that modal logics with a modality for public announcement, for everybody knows, and for somebody knows are all exponentially more succinct than basic modal logi...
متن کاملO ] 1 2 A ug 2 01 7 Succinctness in subsystems of the spatial μ - calculus
In this paper we systematically explore questions of succinctness in modal logics employed in spatial reasoning. We show that the closure operator, despite being less expressive, is exponentially more succinct than the limit-point operator, and that the μ-calculus is exponentially more succinct than the equally-expressive tangled limit operator. These results hold for any class of spaces contai...
متن کاملFixpoint Logics on Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph definitions allow to specify graphs of exponential size using polynomial size descriptions. In many cases, this succinctness increases the computational complexity of decision problems. In this paper, the modelchecking pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 197 شماره
صفحات -
تاریخ انتشار 2013